Optimal bounds for monotonicity and Lipschitz testing over the hypercube

نویسندگان

  • Deeparnab Chakrabarty
  • Seshadhri Comandur
چکیده

The problem of monotonicity testing of the boolean hypercube is a classic well-studied, yet unsolved question in property testing. We are given query access to f : {0, 1} 7→ R (for some ordered range R). The boolean hypercube B has a natural partial order, denoted by ≺ (defined by the product of coordinate-wise ordering). A function is monotone if all pairs x ≺ y in B, f(x) ≤ f(y). The distance to monotonicity, εf , is the minimum fraction of values of f that need to be changed to make f monotone. It is known that the edge tester using O(n log |R|/ε) samples can distinguish a monotone function from one where εf > ε. On the other hand, the best lower bound for monotonicity testing is min(|R|, n). This leaves a quadratic gap in our knowledge, since |R| can be 2. We prove that the edge tester only requires O(n/ε) samples (regardless of R), resolving this question. Our technique is quite general, and we get optimal edge testers for the Lipschitz property. We prove a very general theorem showing that edge testers work for a class of “bounded-derivative” properties, which contains both monotonicity and Lipschitz.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotonicity Testing and Shortest-Path Routing on the Cube

We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hypercube network would imply the existence of efficient monotonicity testers. In particular, if any ` disjoint source-sink pairs on the directed hypercube can be connected with edge-disjoint paths, then monotonicity of...

متن کامل

$L_p$-Testers for Bounded Derivative Properties on Product Distributions

We consider the problem of Lp-testing of class of bounded derivative properties over hypergrid domain with points distributed according to some product distribution. This class includes monotonicity, the Lipschitz property, (α, β)-generalized Lipschitz and many more properties. Previous results for Lp testing on [n] d for this class were known for monotonicity and c-Lipschitz properties over un...

متن کامل

Optimal Parallel Hypercube Algorithms for Polygon Problems

We present parallel techniques on hypercubes for solving optimally a class of polygon problems. We thus obtain optimal O(logn)-lime, n-processor hypercube algorithms for the problems of computing the portions of an n-vertex simple polygonal chain C that are visible from a given source point, computing the convex hull of C, testing an n-verlex simple polygon P for monotonicity, and other related...

متن کامل

Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners

Given a directed graph G = (V,E) and an integer k ≥ 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V,EH) that has (1) the same transitive-closure as G and (2) diameter at most k. Transitive-closure spanners are a common abstraction for applications in access control, property testing and data structures. We show a connection between 2-TC-spanners and local monoton...

متن کامل

Lower Bounds for Testing Properties of Functions on Hypergrid Domains

We introduce strong, and in many cases optimal, lower bounds for the number of queries required to nonadaptively test three fundamental properties of functions f : [n] → R on the hypergrid: monotonicity, convexity, and the Lipschitz property. Our lower bounds also apply to the more restricted setting of functions f : [n]→ R on the line (i.e., to hypergrids with d = 1), where they give optimal l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2012